Xv. Neurology
نویسندگان
چکیده
Recent advances in digital computation techniques have made it possible to approach the problem of automatic diagnosis of the clinical electrocardiogram (EKG) with confidence that a solution will be found. Our research has been mainly concerned with the application of adaptive matched-filter pattern-recognition techniques to EKG diagnosis. In previous publications we have (a) shown that the multiple adaptive matched-filter technique was an efficient means for sorting a number of EKG tracings into groups resembling each other; (b) described our experience with the application of this technique to real EKG on a digital computer for the purpose of recognizing and classifying data resulting from automatic time normalization and synchronization, and observed the accuracy with which the QRS complex patterns are sorted or recognized when compared with precisely known diagnosed complexes; and (c) compared human and machine classification of known reference complexes into a predetermined number of groups. Recently, a series of typical filter patterns for the P, QRS, and ST-T segments of the EKG has been developed; a diagnostic program for rhythm analysis has been prepared; interpretation and diagnostic matrices have been devised which incorporate pattern recognition, rhythm, and extracted parameter data with home stratifying clinical information for the determination of a final EKG diagnosis; the loop of the diagnostic system has been closed by the frequency-modulated transmission of EKG data by telephone lines from the Electrocardiography Laboratory of the Massachusetts Memorial Hospital to a G. E. 225 digital computer at M. I. T. and the subsequent return of a diagnosis to the hospital laboratory for teletype display; and an executive monitoring routine has been incorporated into the program which allows remote teletype control of the diagnostic system by a technician at the hospital laboratory. The introduction of these features has resulted in a remote on-line, real-time digital-computer system for EKG
منابع مشابه
ALKALOIDS OF PAPAVERACEAE (XV) [ 11. ALKALOIDS OF PAPAVER PSE UDO-ORIENTALE POPULATION TAROM
Papaver pseudo-orientale population Tarom was shown to contain two major alkaloids, isothebaine (0.65%), Orientalidine (0.15%) and four minor alkaloids, bracteoline, mecambridine, Or and a novel alkaloid, nor-methyl Or .
متن کاملA practical Primer for Neurosurgery
The amount of information in the field of neurosurgery can be overwhelming. The following materials have been prepared for use as guidelines. While this may not be all-encompassing, it provides good guidelines and a foundation for further learning. XIII. Inflammatory disorders (multiple sclerosis, transverse myelopathy – learned in neurology rotation) XIV. Degenerative diseases (brain: dementia...
متن کاملCs 598csc: Approximation Algorithms
Let G = (V,E) be an undirected graph with arc weights w : V → R+. Define xv for each vertex v as follows: xv = 1, if v is in the vertex cover; xv = 0, if v is not chosen. Our goal is to find min ( ∑ v∈V wvxv), such that xu + xv ≥ 1, ∀e = (u, v) ∈ E, xv ∈ {0, 1}. However, we can’t solve Integer Linear Programming (ILP) problems in polynomial time. So we have to use Linear Programming (LP) to app...
متن کاملWell-posedness for a Higher-order Benjamin-ono Equation
In this paper we prove that the initial value problem associated to the following higher-order Benjamin-Ono equation ∂tv − bH∂ xv + a∂ xv = cv∂xv − d∂x(vH∂xv + H(v∂xv)), where x, t ∈ R, v is a real-valued function, H is the Hilbert transform, a ∈ R, b, c and d are positive constants, is locally well-posed for initial data v(0) = v0 ∈ H(R), s ≥ 2 or v0 ∈ H(R) ∩ L(R; xdx), k ∈ Z+, k ≥ 2.
متن کامل4.1 Introduction 14.2 Linear Programming as a Lower Bounding Technique 14.2.1 Step 1: Reduce Problem to an Integer Program
Given an instance of Weighted Vertex Cover, we can encode it as an integer programming (IP) problem. Create a 0/1 indicator variable xv for each vertex v ∈ V : xv = 1 indicates v is in the cover; xv = 0 otherwise. We force {v : xv = 1} to be a cover by requiring that for each edge {u, v} ∈ E, xu = 1 or xv = 1 (or equivalently, xu + xv ≥ 1). Finally, since our objective is to find a minimum-cost...
متن کاملAn XMLMulti - layer Framework For Music Information Description
xiii Preface xv 0.1 About This Text . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xv 0.2 Scientific Advancement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xv 0.3 Plan of the Text . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvii 0.4 Typographic Conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کامل